Lambda Calculus Type Theory and Natural Language
نویسندگان
چکیده
The theory of continuity based on the Lambek Calculus is well-de-veloped, but we need a compatible extension to include discontinuity.Earlier work set out ingredients: hypersequent calculus and proof netsexpanded with parameter edges. This paper completes a preliminaryline by finalising proof nets for basic discontinuity (that with one pointof discontinuity) and proving correctness with respect to hypersequentcalculus.
منابع مشابه
Sequent combinators: a Hilbert system for the lambda calculus
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the more widespread adoption of natural deduction systems in computer science. This suggests that Hilbert systems, with their more uniform approach to meta-variables and substitution, may be a more suitable framework than l...
متن کاملThree Approaches to Type Structure
We examine three disparate views of the type structure of ]programming languages: Milner's type deduction system and polymorphic ~[e_.!t construct, the theory of subtypes and generic operators, and the polymorphic or second-order typed lambda calculus. These approaches are illustrated with a functional language including product, sum and list constructors. The syntactic behavio~ of types is for...
متن کاملPragmatic Side Effects
In the quest to give a formal compositional semantics to natural languages, semanticists have started turning their attention to phenomena that have been also considered as parts of pragmatics (e.g., discourse anaphora and presupposition projection). To account for these phenomena, the very kinds of meanings assigned to words and phrases are often revisited. To be more specific, in the prevalen...
متن کاملLambda: the ultimate syntax-semantics interface
Spreadsheets in accounting and Matlab in engineering are immensely popular because these glorified calculators let domain experts play : write down a problem in familiar terms and quickly try a number of solutions. Natural-language semanticists have a better tool. Not only does it compute grammar yields and truth values, it also infers types, normalizes terms, and displays truth conditions as f...
متن کاملPolymorphism in English Logical Grammar
The quantifiers and connectives of English present difficulties to standard (Church-style) type theory in linguistics in that they can apply systematically to objects of different form. This paper sketches solutions to this problem with some extensions to the simply typed lambda calculus, including Damas-Milner types and System F or the polymorphic lambda calculus. The goal is to maintain the “...
متن کامل